Clique-connecting forest and stable set polytopes

نویسنده

  • Denis Cornaz
چکیده

Let G = (V, E) be a simple undirected graph. A forest F ⊆ E of G is said to be clique-connecting if each tree of F spans a clique of G. This paper adresses the clique-connecting forest polytope. First we give a formulation and a polynomial time separation algorithm. Then we show that the nontrivial nondegenerate facets of the stable set polytope are facets of the clique-connecting polytope. Finally we introduce a family of rank inequalities which are facets, and which generalize the clique inequalities.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Non-Rank Facets of Stable Set Polytopes of Webs with Clique Number Four

Graphs with circular symmetry, called webs, are relevant for describing the stable set polytopes of two larger graph classes, quasi-line graphs [8, 12] and claw-free graphs [7, 8]. Providing a decent linear description of the stable set polytopes of claw-free graphs is a long-standing problem [9]. However, even the problem of finding all facets of stable set polytopes of webs is open. So far, i...

متن کامل

On Non-Rank Facets in Stable Set Polytopes of Webs with Clique Number Four

Graphs with circular symmetry, called webs, are relevant for describing the stable set polytopes of two larger graph classes, quasi-line graphs [6,10] and claw-free graphs [5,6]. Providing a decent linear description of the stable set polytopes of claw-free graphs is a longstanding problem [7]. However, even the problem of finding all facets of stable set polytopes of webs is open. So far, it i...

متن کامل

A construction for non-rank facets of stable set polytopes of webs

Graphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set polytopes of two larger graph classes, quasi-line graphs [9,14] and claw-free graphs [8,9]. Providing a decent linear description of the stable set polytopes of claw-free graphs is a long-standing problem [10]. However, even the problem of finding all facets of stable set polytopes of webs is open. So far,...

متن کامل

On Non-Rank Facets of Stable Set Polytopes of Webs with Clique Number Four-Extended Abstract-

Graphs with circular symmetry, called webs, are relevant for describing the stable set polytopes of two larger graph classes, quasi-line graphs [6,10] and claw-free graphs [5,6]. Providing a decent linear description of the stable set polytopes of claw-free graphs is a longstanding problem [7]. However, even the problem of finding all facets of stable set polytopes of webs is open. So far, it i...

متن کامل

Almost all webs with odd clique number 5 are not rank - perfect

Graphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set polytopes of two larger graph classes, quasi-line graphs [7,11] and claw-free graphs [6,7]. Providing a decent linear description of the stable set polytopes of claw-free graphs is a long-standing problem [8]. However, even the problem of finding all facets of stable set polytopes of webs is open. So far, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • RAIRO - Operations Research

دوره 44  شماره 

صفحات  -

تاریخ انتشار 2010